Quantization as Histogram Segmentation: Optimal Scalar Quantizer Design in Network Systems

Quantization as Histogram Segmentation: Globally Optimal Scalar Quantizer Design in Network System

We propose a polynomial-time algorithm for optimal scalar quantizer design on discrete-alphabet sources. Special cases of the proposed approach yield optimal design algorithms for fixed-rate and entropy-constrained scalar quantizers, multi-resolution scalar quantizers, multiple description scalar quantizers, and Wyner-Ziv scalar quantizers. The algorithm guarantees globally optimal solutions fo...

Optimal nearly uniform scalar quantizer design for wavelet coding

Average Complexity Analysis of Scalar Quantizer design

In this paper an exact and complete analysis of average design complexities of Lloyd-Max's scalar quantizers, scalar compandors and scalar quantizers designed using the hybrid model is carried out. The average design complexity depends on arithmetic complexity, memory complexity and implementation complexity. It is demonstrated that for a fixed number of quantizaton levels N, scalar compandors ...

Optimal Scalar Quantization for Parameter Estimation

In this paper, we study an asymptotic approximation of the Fisher information for the estimation of a scalar parameter using quantized measurements. We show that, as the number of quantization intervals tends to infinity, the loss of Fisher information induced by quantization decreases exponentially as a function of the number of quantization bits. A characterization of the optimal quantizer th...

Optimal Entropy - Constrained Scalar Quantization of aUniform

Optimal scalar quantization subject to an entropy constraint is studied for a wide class of diierence distortion measures including rth power distortions with r > 0. It is proved that if the source is uniformly distributed over an interval, then for any entropy constraint R (in nats), an optimal quantizer has N = e R interval cells such that N ? 1 cells have equal length d and one cell has leng...